Generalized Hamming weights of three classes of linear codes
نویسندگان
چکیده
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the generalized Hamming weights of three classes of linear codes constructed through defining sets and determine them partly for some cases. Particularly, in the semiprimitive case we solve an problem left in Yang et al. (2015) [30].
منابع مشابه
Computation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملA class of cyclotomic linear codes and their generalized Hamming weights
Abstract Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two alternative formulas to calculate their generalized Hamming weights. Lastly, we determine their weight distribution and generalized Hamming weights partial...
متن کاملGeneralized Hamming weights of a class of linear codes
In [22], Kelan Ding and Cunsheng Ding presented a class of linear codes and determined their weight distributions. In this paper, we focus on the generalized Hamming weights of these codes. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting results about subspaces and their dual spaces. On this basis, we solve all the generalized Hamming w...
متن کاملGeneralized rank weights : a duality statement
We consider linear codes over some fixed finite field extension Fqm/Fq, where Fq is an arbitrary finite field. In [1], Gabidulin introduced rank metric codes, by endowing linear codes over Fqm with a rank weight over Fq and studied their basic properties in analogy with linear codes and the classical Hamming distance. Inspired by the characterization of the security in wiretap II codes in terms...
متن کاملA Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS∗
In this paper, we introduce a lower bound for the generalized Hamming weights, which is applicable to arbitrary linear code, in terms of the notion of well-behaving. We also show that any [n, k] linear code C over a finite field F is the t-th rank MDS for t such that g(C) + 1 ≤ t ≤ k where g(C) is easily calculated from the basis of F so chosen that whose first n − k elements generate C⊥. Final...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 45 شماره
صفحات -
تاریخ انتشار 2017